Efficient global penetration depth computation for articulated models
نویسندگان
چکیده
منابع مشابه
Efficient Motion Planning using Generalized Penetration Depth Computation
Liangjun Zhang: Efficient Motion Planning using Generalized Penetration Depth Computation. (Under the direction of Dinesh Manocha.) Motion planning is a fundamental problem in robotics and also arises in other applications including virtual prototyping, navigation, animation and computational structural biology. It has been extensively studied for more than three decades, though most practical ...
متن کاملFast Penetration Depth Computation and its Applications
In this paper, we highlight our past experiences on fast penetration depth computation and its applications in different areas such as physically-based animation, 6DOF haptic rendering and robot motion planning.
متن کاملA Fast and Practical Algorithm for Generalized Penetration Depth Computation
We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the minimal translational and rotational motion that separates the two objects. We formulate the PDg computation based on modeldependent distance metrics using displacement vectors. As a result, our formulation is independent...
متن کاملA Fast Method for Local Penetration Depth Computation
This paper presents a fast method for determining an approximation of the local penetration information for intersecting polyhedral models. As opposed to most techniques, this algorithm requires no specific knowledge of the object’s geometry or topology, or any pre-processing computations. In order to achieve real-time performance even for complex, non-convex models, we decouple the computation...
متن کاملA Fast Method for Local Penetration Depth Computation Appendix
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a hashtable), we pay attention to the implementation details to ensure that the segment clustering is performed in almost linear time. 1 Intersection segment clustering
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Design
سال: 2016
ISSN: 0010-4485
DOI: 10.1016/j.cad.2015.07.007